Reasoning with Uncertainty by Nmatrix-Metric Semantics

نویسندگان

  • Ofer Arieli
  • Anna Zamansky
چکیده

Non-deterministic matrices, a natural generalization of manyvalued matrices, are semantic structures in which the value assigned to a complex formula may be chosen non-deterministically from a given set of options. We show that by combining Nmatrices and preferential metrics-based considerations, one obtains a family of logics that are useful for reasoning with uncertainty. We investigate the basic properties of these logics and demonstrate their usefulness in handling incomplete and inconsistent information.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Reasoning about Uncertainty in Metric Spaces

We set up a model for reasoning about metric spaces with belief theoretic measures. The uncertainty in these spaces stems from both probability and metric structures. To represent both aspect of uncertainty, we choose an expected distance function as a measure of uncertainty. A formal logical system is constructed for the reasoning about expected distance. Soundness and completeness are shown f...

متن کامل

Non-deterministic Multi-valued Logics and their Applications

Non-deterministic multi-valued matrices (Nmatrices) are a new, fruitful and quickly expanding field of research first introduced a few years ago by Avron and Lev. Since then it has been rapidly developing towards a foundational logical theory and has found numerous applications in different research areas, such as reasoning under uncertainty, automated reasoning, and proof theory. The novelty o...

متن کامل

Qualitative and Quantitative Reasoning in Hybrid Probabilistic Logic Programs

Reasoning with qualitative and quantitative uncertainty is required in some real-world applications [6]. However, current extensions to logic programming with uncertainty support representing and reasoning with either qualitative or quantitative uncertainty. In this paper we extend the language of Hybrid Probabilistic Logic programs [28, 25], originally introduced for reasoning with quantitativ...

متن کامل

$C$-class and $F(psi,varphi)$-contractions on $M$-metric spaces

Partial metric spaces were introduced by Matthews in 1994 as a part of the study of denotational semantics of data flow networks. In 2014 Asadi and {it et al.} [New Extension of $p$-Metric Spaces with Some fixed point Results on $M$-metric paces, J. Ineq. Appl. 2014 (2014): 18] extend the Partial metric spaces to $M$-metric spaces. In this work, we introduce the class of $F(psi,varphi)$-contrac...

متن کامل

Metric Characterizations of Contextual Logic Programs

The aim of this paper is twofold: to characterize contextual logic programs by means of metric semantics and to argue the usefulness of metric characterizations for formally reasoning about program properties. A new denotational semantics of contextual logic programs is proposed. It is deened compositionally, without any help of any declarative paradigm and of any transition system. Following t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008